a quantum evolutionary algorithm for the vehicle routing problem with single-sided time window setting

Authors

ali kourank beheshti isfahan university of technology

seyed reza hejazi isfahan university of technology

abstract

customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. delivery quality has several parameters such as deliver time window options, time window size, etc. in this paper we focus on one of these parameters, namely time window setting. it has a direct impact upon customer satisfaction and business profit. on the other hand, delivery time windows affect routing and distribution costs. generally, in the routing operation, time windows have been determined by customers or distributer and are considered as input parameters for the vehicle routing problem with time window (vrptw) model. in this paper, a mathematical model is proposed for the integration of these two decisions in other words, in the present model, time window setting decisions are integrated with routing decisions. then a column generation approach is employed to obtain the lower bounds of problems and to solve the problems, a quantum algorithm is proposed. finally, the computational results of some instances are reported and the results of these approaches are compared. the results demonstrate the effectiveness of the quantum algorithm in solving this problem.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting

Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...

full text

A Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

full text

A HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM

The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...

full text

Evolutionary Approach for Energy Minimizing Vehicle Routing Problem with Time Windows and Customers’ Priority

A new model and solution for the energy minimizing vehicle routing problem with time windows (EVRPTW) and customers’ priority is presented in this paper. In this paper unlike prior attempts to minimize cost by minimizing overall traveling distance, the model also incorporates energy minimizing which meets the latest requirements of green logistics. This paper includes the vehicles load as an ad...

full text

a hybrid metaheuristic algorithm for the vehicle routing problem with delivery time cost

this paper addresses the vehicle routing problem with delivery time cost. this problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. in this research, a hybrid metaheuristic approa...

full text

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of industrial engineering and productional research-

جلد ۲۵، شماره ۴، صفحات ۲۸۷-۲۹۵

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023